On Definability in Dependence Logic
نویسندگان
چکیده
We study the expressive power of open formulas of dependence logic introduced in Väänänen [Dependence logic (Vol. 70 of London Mathematical Society Student Texts), 2007]. In particular, we answer a question raised by Wilfrid Hodges: how to characterize the sets of teams definable bymeans of identity only in dependence logic, or equivalently in independence friendly logic.
منابع مشابه
Uniform Definability in Propositional Dependence Logic
Both propositional dependence logic and inquisitive logic are expressively complete. As a consequence, every formula in the language of inquisitive logic with intuitionistic disjunction or intuitionistic implication can be translated equivalently into a formula in the language of propositional dependence logic without these two connectives. We show that although such a (noncompositional) transl...
متن کاملTwo Forms of Dependence in Propositional Logic: Controllability and Definability
We investigate two forms of dependence between variables and/or formulas within a propositional knowledge base: controllability (a set of variables X controls a formula if there is a way to fix the truth value of the variables in X in order to achieve to have a prescribed truth value) and definability (X defines a variable y if every truth assignment of the variables inX enables us finding out ...
متن کاملCharacterizing Frame Definability in Team Semantics via the Universal Modality
Let ML( u) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We characterize the definability of ML( u) in the spirit of the well-known Goldblatt-Thomason-Theorem. We show that an elementary class F of Kripke frames is definable in ML( u) if and only if F is closed under taking generated subframes and bounded morphic ...
متن کاملOn Definability in Multimodal Logic
Three notions of definability in multimodal logic are considered. Two are analogous to the notions of explicit definability and implicit definability introduced by Beth in the context of first-order logic. However, while by Beth’s theorem the two types of definability are equivalent for first-order logic, such an equivalence does not hold for multimodal logics. A third notion of definability, r...
متن کاملGlobal Definability in Basic Modal Logic
We present results on global definability in basic modal logic, and contrast our model-theoretic results and proof techniques with known results about local definability.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Journal of Logic, Language and Information
دوره 18 شماره
صفحات -
تاریخ انتشار 2009